package binary_search;

public class peakIndexInMountainArray {
    public int peakIndexInMountainArray(int[] arr) {
        int left = 0;
        int right = arr.length - 1;
        int mid = 0;
        while(left < right) {
            mid = left + (right-left+1)/2;
            if(arr[mid] >= arr[mid-1]) {
                left = mid;
            }else {
                right = mid-1;
            }
        }
        return right;

    }
}
